Polygonal Numbers

نویسنده

  • Adam Grabowski
چکیده

In the article the formal characterization of triangular numbers (famous from [15] and words “EYPHKA! num = ∆ + ∆ + ∆”) [17] is given. Our primary aim was to formalize one of the items (#42) from Wiedijk’s Top 100 Mathematical Theorems list [33], namely that the sequence of sums of reciprocals of triangular numbers converges to 2. This Mizar representation was written in 2007. As the Mizar language evolved and attributes with arguments were implemented, we decided to extend these lines and we characterized polygonal numbers. We formalized centered polygonal numbers, the connection between triangular and square numbers, and also some equalities involving Mersenne primes and perfect numbers. We gave also explicit formula to obtain from the polygonal number its ordinal index. Also selected congruences modulo 10 were enumerated. Our work basically covers the Wikipedia item for triangular numbers and the Online Encyclopedia of Integer Sequences (http://oeis.org/A000217). An interesting related result [16] could be the proof of Lagrange’s four-square theorem or Fermat’s polygonal number theorem [32].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Algorithm of Polygonal Fuzzy Neural Network

Symmetric polygonal fuzzy number is employed to build an improved feedforward fuzzy neural network (FNN). First, a novel fuzzy arithmetic and extension principle for the polygonal fuzzy numbers is derived. Second, the topological architecture of a three layer feedforward FNN is presented, and the input-output law of this network is systematically studied. Third, a fuzzy BP learning algorithm fo...

متن کامل

A Diophantine Problem concerning Polygonal Numbers

Motivated by some earlier Diophantine works on triangular numbers by Ljunggren and Cassels, we consider similar problems for general polygonal numbers.

متن کامل

A 43 INTEGERS 12 ( 2012 ) ARITHMETIC PROGRESSIONS IN THE POLYGONAL NUMBERS Kenneth

In this paper, we investigate arithmetic progressions in the polygonal numbers with a fixed number of sides. We first show that four-term arithmetic progressions cannot exist. We then describe explicitly how to find all three-term arithmetic progressions. Finally, we show that not only are there infinitely many three-term arithmetic progressions, but that there are infinitely many three-term ar...

متن کامل

Integral equation for gauge invariant quark Green’s function

We consider gauge invariant quark two-point Green’s functions in which the gluonic phase factor follows a skew-polygonal line. Using a particular representation for the quark propagator in the presence of an external gluon field, functional relations between Green’s functions with different numbers of segments of the polygonal lines are established. An integral equation is obtained for the Gree...

متن کامل

Partitions Excluding Specific Polygonal Numbers As Parts

A partition λ of the nonnegative integer n is a sequence of nonnegative integers λ1 ≥ λ2 ≥ · · · ≥ λr with λ1 + λ2 + · · · + λr = n. Each value λi, 1 ≤ i ≤ r, is called a part of the partition. In this note, we consider partitions of n with parts related to k-gonal numbers for some fixed integer k ≥ 3. Various works have appeared involving partitions into polygonal parts. For example, M. D. Hir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Formalized Mathematics

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2013